package ink.lovejinhu.leetcode;

/**
 * @author jinhu
 * created 2021-07-13 15:07
 */
public class Solution_0367 {
    /**
     * @param num
     * @return
     */
    public boolean isPerfectSquare(int num) {
        if (num == 1) return true;
        for (int i = 0; i <= num / 2; i++) {
            if (i * i == num) return true;
        }
        return false;
    }
}
